Faster Approximation Algorithms for Scheduling with Fixed Jobs Klaus Jansen1 1 Lars Prädel1

Source URL: theory.epfl.ch

A fractional derivative on the Wiener space and applications to approximation theory Stefan Geiss University of Innsbruck Given an abstract Wiener space on a probability space (M, Σ, µ) and Z ∈ L2 , we introduce a fr

Source URL: icsaa.iam.uni-bonn.de

RIGOROUS UNIFORM APPROXIMATION OF D-FINITE FUNCTIONS USING CHEBYSHEV EXPANSIONS ALEXANDRE BENOIT, MIOARA JOLDES, AND MARC MEZZAROBBA Abstract. A wide range of numerical methods exists for computing polynomial approximati

Source URL: www.marc.mezzarobba.net

• Algebra
• Orthogonal polynomials
• Elementary algebra
• Numerical analysis
• Approximation theory
• Chebyshev polynomials
• Polynomial
• Recurrence relation
• Holonomic function
• Minimax approximation algorithm
• Rational function
• Factorization

R Foundations and Trends in Theoretical Computer Science Vol. 9, No–210 c 2014 S. Sachdeva and N. K. Vishnoi

Source URL: www.cs.yale.edu

• Mathematics
• Algebra
• Mathematical analysis
• Matrix theory
• NP-complete problems
• Numerical analysis
• Polynomial
• Approximation theory
• Pi
• Chebyshev polynomials
• Eigenvalues and eigenvectors
• Matrix

Acceptance of the Dana Medal of the Mineralogical Society of America for 2009

Source URL: www.minsocam.org

• Chemistry
• Density functional theory
• Local-density approximation
• Crystal
• Quantum Monte Carlo

Approximation by Mediants Wieb Bosma Mathematics of Computation, Vol. 54, NoJan., 1990), ppStable URL: http://links.jstor.org/sici?sici=%%2954%3A189%3C421%3AABM%3E2.0.CO%3B2-3 Mathemat

Source URL: www.math.ru.nl

• Mathematical analysis
• Mathematics
• Number theory
• Continued fractions
• Algebra
• Distribution
• Logarithm
• Random permutation statistics
• Argument principle

Chapter 10 Bin Packing Here we consider the classical Bin Packing problem: We are given a set I = {1, . . . , n} of items, where item i ∈ I has size si ∈ (0, 1] and a set B = {1, . . . , n} of bins with capacity one

Source URL: www2.informatik.hu-berlin.de

• Computational complexity theory
• Theory of computation
• Complexity classes
• Packing problems
• NP-complete problems
• Bin packing problem
• Approximation algorithms
• Polynomial-time approximation scheme
• Partition problem
• NP
• NC
• Time complexity

Solution Quality and Efficiency in Discrete Optimization 2 Scientific Work

Source URL: www.ite.ethz.ch

• Computational complexity theory
• Mathematics
• Theory of computation
• Operations research
• NP-complete problems
• Mathematical optimization
• Convex optimization
• Travelling salesman problem
• Approximation algorithm
• Optimization problem
• Algorithm
• Genetic algorithm

On the Computational Complexity of ReoptimizationScientific Work

Source URL: www.ite.ethz.ch

• Computational complexity theory
• Approximation algorithms
• NP-complete problems
• Complexity classes
• Theoretical computer science
• Travelling salesman problem
• APX
• Optimization problem
• Combinatorial optimization
• Genetic algorithm
• Heuristic
• Steiner tree problem

Chapter VII Optimization and Approximation Topics 1

Source URL: ejde.math.unt.edu

• Mathematical analysis
• Mathematics
• Analysis
• Convex analysis
• Linear algebra
• Operator theory
• Functions and mappings
• Convex function
• Mean value theorem
• Hilbert space
• Derivative
• Norm